Bottom-up Abduction by Model Generation
نویسندگان
چکیده
We invest igate two real izat ions of paral lel abduct ive reasoning systems using the model generat ion theorem prover M G T P . The f irst one, called the M G T P + M G T P method , is a co-operat ive problem-solv ing archi tecture in wh ich model generat ion and consistency checking communicate w i t h each other. There , paral lel ism is explo i ted by checking consistencies in paral le l . However, since th is system consists of two dif ferent components, the possibi l i ties for paral le l izat ion are l im i t ed . In contrast , the other me thod , called the Skip m e t h o d , does not separate the inference engine f r om consistency checking, bu t realizes bo th funct ions in on ly one M G T P that is used as a generateand-test mechanism. In th is me thod , mu l t i p le models can be kept in d is t r ibu ted memories, thus a great amount of paral le l ism can be obta ined. We also a t t emp t the upside-down metain te rp re ta t ion approach for abduc t ion , in which top-down reasoning is s imulated by a b o t t o m up reasoner.
منابع مشابه
Specifying Transactions for Extended Abduction
Extended abduction introduced by Inoue and Sakama ( 1995 ) generalizes traditional abduction in the sense that it can compute negative explanations by removing hypotheses from a nonmonotonic background theory, rather than only adding them. Also, it has a mechanism of computing anti-explanations to unexplain negative observations. Such extended abduction not only enhances reasoning ability of tr...
متن کاملAn Experimental CLP Platform for Integrity Constraints and Abduction
Integrity constraint and abduction are important in query-answering systems for enhanced query processing and for expressing knowledge in databases. A straightforward characterization of the two is given in a subset of the language CHR , originally intended for writing constraint solvers to be applied for CLP languages. This subset has a strikingly simple computational model that can be execute...
متن کاملCHR as grammar formalism. A first report
Grammars written as Constraint Handling Rules (CHR) can be executed as efficient and robust bottom-up parsers that provide a straightforward, non-backtracking treatment of ambiguity. Abduction with integrity constraints as well as other dynamic hypothesis generation techniques fit naturally into such grammars and are exemplified for anaphora resolution, coordination and text interpretation.
متن کاملLaconic discourses and total eclipses: abduction in DICE
The goal of this chapter is demonstrate one particular use of abduction in the processing of natural language discourse. DICE (Discourse In Commonsense Entailment) can be used to model both interpretation and generation. For interpretation, it uses defeasible deduction to determine the discourse structures and event structures underlying multisentential texts. For generation, it uses abduction ...
متن کاملOn the Duality of Abduction and Model Generation
We present a duality relationship between abduction for deenite abductive programs and model generation on the only-if part of these programs. As was pointed out by Console et all, abductive solutions for an abductive program correspond to models of the only-if part. We extend this observation by showing that the procedural semantics of abduction itself can be interpreted dually as a form of mo...
متن کاملar X iv : c s . PL / 0 10 60 59 v 1 2 9 Ju n 20 01 CHR as grammar formalism A first report
Grammars written as Constraint Handling Rules (CHR) can be executed as efficient and robust bottom-up parsers that provide a straightforward, non-backtracking treatment of ambiguity. Abduction with integrity constraints as well as other dynamic hypothesis generation techniques fit naturally into such grammars and are exemplified for anaphora resolution, coordination and text interpretation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993